Precongruence Formats for Decorated Trace Preorders
نویسندگان
چکیده
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin’s structural approach. For several preorders in the linear time – branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.
منابع مشابه
Syntactic Formats for Free An Abstract Approach to Process Equivalence
A framework of Plotkin and Turi’s, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system specifications which guarantee operational preorders to be precongruences. The technique is applied to the tra...
متن کاملOn Full Abstractness for Fair Testing
Fair-testing preorders were introduced in 13, 3] in order to overcome diiculties that traditional testing/failures preorders have in tackling divergent behavior. This paper establishes the appropriateness and \optimality" of the fair-must precongruence by proving that it is the coarsest precongruence respecting a natural notion of observable behavior (maximal traces) under a non-catastrophic in...
متن کاملPrecongruence Formats with Lookahead through Modal Decomposition
BLOOM, FOKKINK & VAN GLABBEEK (2004) presented a method to decompose formulas from Hennessy-Milner logic with regard to a structural operational semantics specification. A term in the corresponding process algebra satisfies a Hennessy-Milner formula if and only if its subterms satisfy certain formulas, obtained by decomposing the original formula. They used this decomposition method to derive c...
متن کاملMultiparty Testing Preorders
Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose...
متن کاملPredicates as processes: Linear implication is a branching-time causality-preserving precongruence
We summarise recent advances in the predicates-as-processes paradigm. In particular, we note the non-commutative logic MAV1 featuring choice and a novel dual pair of nominal quantifiers. For fragments of MAV1, we have shown the soundness of implication with respect to both weak simulation and pomset trace inclusion; hence implication is a branching-time causality-preserving precongruence. The s...
متن کامل